منابع مشابه
Decidability of Mereological Theories
Mereology is a theory based on a binary predicate “being a part of.” Most philosophers believe that such a predicate must at least define a partial ordering: that is, it is reflexive (P1), antisymmetric (P2) and transitive (P3). In other words, three basic principles of mereology can thus be fixed. The theory axiomatized by these three basic principles is called ground mereology (GM). There are...
متن کاملDecidability of MSO Theories of Tree Structures
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two steps: first, we reduce the considered problem to the problem of determining, for any Rabin tree automaton, whether it accepts a given tree; then, we exploit a suitable notion of tree equivalence to reduce (a number ...
متن کاملCombination of Disjoint Theories: Beyond Decidability
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combination of two disjoint decidable stably infinite theories. We here study combinations involving an arbitrary first-order theory. Decidability is lost, but refutational completeness is preserved. We consider two cases and ...
متن کاملAutomatic Decidability for Theories with Counting Operators
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملOn Equational Theories, Unification and Decidability
The following classes of equational theories, which are important in unification theory, are presented: permutative, finite, Noetherian, simple, almost collapse free, collapse free, regular, and ~-free theories. The relationships between the particular theories are shown and the connection between these classes and the unification hierarchy is pointed out. We give an equational theory that alwa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2009
ISSN: 1425-3305
DOI: 10.12775/llp.2009.004